Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters
نویسندگان
چکیده
A standard stochastic global optimization method is applied to the challenging problem of finding the minimum energy conformation of a cluster of identical atoms interacting through the Lennard-Jones potential. The method proposed is based on the use of a two-phase local search procedure which is capable of significantly enlarge the basin of attraction of the global optimum. The experiments reported confirm the striking superiority of these approach, in particular for all those cases which are considered in the literature as the most challenging ones, namely 75, 98, 102 atoms. While being capable of discovering all putative global optima in the range considered, the method proposed improved by more than two orders of magnitude the speed and the percentage of success in finding the global optima of clusters of 75, 98, 102 atoms.
منابع مشابه
Fusion Process of Lennard-jones Clusters: Global Minima and Magic Numbers Formation
We present a new theoretical framework for modelling the fusion process of Lennard-Jones (LJ) clusters. Starting from the initial tetrahedral cluster configuration, adding new atoms to the system and absorbing its energy at each step, we find cluster growing paths up to the cluster sizes of up to 150 atoms. We demonstrate that in this way all known global minima structures of the LJ-clusters ca...
متن کاملMinimal interatomic distance in Morse clusters
In this paper we derive a lower bound, independent from the number of atoms N , for the minimal interatomic distances between atoms in a cluster whose total energy is modelled by means of the so called Morse potential. A similar result was previously proven for Lennard-Jones clusters but the proof can not be extended to Morse clusters. Besides the theoretical interest, the derivation of this lo...
متن کاملAn unbiased population-based search for the geometry optimization of Lennard-Jones clusters: 2 leq N leq 372
This article presents the results obtained using an unbiased Population Based Search (PBS) for optimizing Lennard-Jones clusters. PBS is able to repeatedly obtain all putative global minima, for Lennard-Jones clusters in the range 2 < or = N < or = 372, as reported in the Cambridge Cluster Database. The PBS algorithm incorporates and extends key techniques that have been developed in other Lenn...
متن کاملPDECO: Parallel differential evolution for clusters optimization
The optimization of the atomic and molecular clusters with a large number of atoms is a very challenging topic. This article proposes a parallel differential evolution (DE) optimization scheme for large-scale clusters. It combines a modified DE algorithm with improved genetic operators and a parallel strategy with a migration operator to address the problems of numerous local optima and large c...
متن کاملGlobal Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
We describe a global optimization technique using “basin-hopping” in which the potential energy surface is transformed into a collection of interpenetrating staircases. This method has been designed to exploit the features that recent work suggests must be present in an energy landscape for efficient relaxation to the global minimum. The transformation associates any point in configuration spac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp. Opt. and Appl.
دوره 26 شماره
صفحات -
تاریخ انتشار 2003